Ameso optimization: A relaxation of discrete midpoint convexity
نویسندگان
چکیده
منابع مشابه
Discrete Midpoint Convexity
For a function defined on a convex set in a Euclidean space, midpoint convexity is the property requiring that the value of the function at the midpoint of any line segment is not greater than the average of its values at the endpoints of the line segment. Midpoint convexity is a well-known characterization of ordinary convexity under very mild assumptions. For a function defined on the integer...
متن کاملConvexity in Discrete Space
This paper looks at axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell complexes. Oriented matroids are shown to have a structure which naturally satisfies the axioms for being a convex geometry. Cell complexes are shown to give rise to various different notions of convexity, one of which...
متن کاملMethod of Relaxation Applied to Optimization of Discrete Systems
In this work, the relaxation method is presented and then applied to the optimization of a family of discrete systems. Thus, a condition for the relationship between the minimum of the original problem and of the relaxed problem is translated to an equivalent condition of minimum principle. Several examples illustrate this technique and the condition obtained.
متن کاملDiscrete Convexity and Unimodularity. I
In this paper we develop a theory of convexity for the lattice of integer points Z, which we call theory of discrete convexity. What subsets X ⊂ Z could be called ”convex”? One property seems indisputable: X should coincide with the set of all integer points of its convex hull co(X). We call such sets pseudo-convex. The resulting class PC of all pseudo-convex sets is stable under intersection b...
متن کاملA Discrete Hybrid Teaching-Learning-Based Optimization algorithm for optimization of space trusses
In this study, to enhance the optimization process, especially in the structural engineering field two well-known algorithms are merged together in order to achieve an improved hybrid algorithm. These two algorithms are Teaching-Learning Based Optimization (TLBO) and Harmony Search (HS) which have been used by most researchers in varied fields of science. The hybridized algorithm is called A Di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: 0166-218X
DOI: 10.1016/j.dam.2020.11.004